A New Immune Genetic Algorithm for the Large Scale Ship Routing Problems
نویسندگان
چکیده
The ship routing problem (SRP) is a special variant of the classical vehicle routing problems (VRPs), which is different from both the VRP with backhauls (VRPB) and the VRP with pickup and delivery (VRPPD). This paper proposes a new immune genetic algorithm for the large scale SRP. The backhaul and time window constraints are also considered. The immune GA is innovated based on the classic GA and it can improve the general search ability and fight the premature convergence effectively. Numerical experiments indicate the proposed method is effective and competitive in reducing both the total shipping cost and the needed ship numbers.
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA New Mathematical Formulation for Multi-product Green Capacitated Inventory Routing Problem in Perishable Products Distribution Considering Dissatisfaction of Customers
In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملMultimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...
متن کاملEfficient Strategy based on Improved Biogeography-based Algorithm for Inventory Routing problem
Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...
متن کامل